DROPS

Document

DOI: 10.4230/OASIcs.ATMOS.2019.12

A Graph- and Monoid-Based Framework for Price-Sensitive Routing in Local Public Transportation Networks

Authors: Ricardo Euler and Ralf Borndörfer

Published in: OASIcs, Volume 75, 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)

Abstract

We present a novel framework to mathematically describe the fare systems of local public transit companies. The model allows the computation of a provably cheapest itinerary even if prices depend on a number of parameters and non-linear conditions. Our approach is based on a ticket graph model to represent tickets and their relation to each other. Transitions between tickets are modeled via transition functions over partially ordered monoids and a set of symbols representing special properties of fares (e.g. surcharges). Shortest path algorithms rely on the subpath optimality property. This property is usually lost when dealing with complicated fare systems. We restore it by relaxing domination rules for tickets depending on the structure of the ticket graph. An exemplary model for the fare system of Mitteldeutsche Verkehrsbetriebe (MDV) is provided. By integrating our framework in the multi-criteria RAPTOR algorithm we provide a price-sensitive algorithm for the earliest arrival problem and assess its performance on data obtained from MDV. We discuss three preprocessing techniques that improve run times enough to make the algorithm applicable for real-time queries.

Cite as

Ricardo Euler and Ralf Borndörfer. A Graph- and Monoid-Based Framework for Price-Sensitive Routing in Local Public Transportation Networks. In 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019). Open Access Series in Informatics (OASIcs), Volume 75, pp. 12:1-12:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{euler_et_al:OASIcs.ATMOS.2019.12,
  author =	{Euler, Ricardo and Bornd\"{o}rfer, Ralf},
  title =	{{A Graph- and Monoid-Based Framework for Price-Sensitive Routing in Local Public Transportation Networks}},
  booktitle =	{19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)},
  pages =	{12:1--12:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-128-3},
  ISSN =	{2190-6807},
  year =	{2019},
  volume =	{75},
  editor =	{Cacchiani, Valentina and Marchetti-Spaccamela, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2019.12},
  URN =		{urn:nbn:de:0030-drops-114243},
  doi =		{10.4230/OASIcs.ATMOS.2019.12},
  annote =	{Keywords: shortest path, public transit, optimization, price-sensitive, raptor, fare, operations research}
}

Search Results

Documents authored by Euler, Ricardo

A Graph- and Monoid-Based Framework for Price-Sensitive Routing in Local Public Transportation Networks

Abstract

Cite as

Thanks for your feedback!

Could not send message